面向社交网络分析的差分隐私保护研究综述

阐述了数据的差分隐私保护概念,给出了差分隐私保护模型,从理论上描述了其噪声机制和组合性质,着重进述了差分隐私保护模型在社交网络发布数据隐私保护上的应用及发展,给出了差分隐私保护应用于度分布查询、子图计数、聚类系数计算、边权重计算等社交网络分析技术的实验结果。分析发现,研究差分隐私保护应重点考虑隐私预算和噪声机制,隐私预算决定了隐私保护强度,噪声机制决定了查询准确性;探讨差分隐私保护在社交网络领域的应用,是一个重要的研究方向。     

Predicting metamorphic relations for testing scientific software: a machine learning approach using graph kernels

Comprehensive, automated software testing requires an oracle to check whether the output produced by a test case matches the expected behaviour of the programme. But the challenges in creating suitable oracles limit the ability to perform automated testing in some programmes, and especially in scientific software. Metamorphic testing is a method for automating the testing process for programmes without test oracles. This technique operates by checking whether the programme behaves according to properties called metamorphic relations. A metamorphic relation describes the change in output when the input is changed in a prescribed way. Unfortunately, finding the metamorphic relations satisfied by a programme or function remains a labour‐intensive task, which is generally performed by a domain expert or a programmer. In this work, we propose a machine learning approach for predicting metamorphic relations that uses a graph‐based representation of a programme to represent control flow and data dependency information. In earlier work, we found that simple features derived from such graphs provide good performance. An analysis of the features used in this earlier work led us to explore the effectiveness of several representations of those graphs using the machine learning framework of graph kernels, which provide various ways of measuring similarity between graphs. Our results show that a graph kernel that evaluates the contribution of all paths in the graph has the best accuracy and that control flow information is more useful than data dependency information. The data used in this study are available for download at http://www.cs.colostate.edu/saxs/MRpred/functions.tar.gz to help researchers in further development of metamorphic relation prediction methods. Copyright © 2015 John Wiley & Sons, Ltd.     

基于紧密中心性的无线mesh骨干网网关部署

将定向天线和Delaunay图应用于无线mesh骨干网络的网关部署,提出了基于紧密中心性的无线mesh骨干网络网关部署算法。根据已知的mesh路由器和网关的最大流通量对网络进行划分,形成Delaunay子图,在划分的子图中根据欧几里德距离找出距离中心点最近的3个节点,形成候选网关集,在候选网关集中选择到其他节点总路径最短的节点作为网关的部署位置,将每个子图的网关位置输出。仿真结果表明,根据网关最大流通量进行合理网络划分后,算法能最小化网络的网关数量,由mesh路由器到网关的总路径长度优于随机算法。     

电信大规模社交关系网络图数据挖掘研究

电信技术的发展使得通话网络几乎覆盖了整个社会,对电信运营商来说,这个庞大的社会网络蕴藏着巨大的商机.尤其在日益激烈的市场竞争中,客户关系的维护、客户潜在价值的挖掘以及有针对性地对客户进行营销等对电信图数据的挖掘,受到了强烈关注.通过对比,研究了当前针对类似电信网络的大规模社交关系网络图数据进行挖掘的分布式和单机图计算工具和框架,并对单机图计算工具Graphchi的单机处理数据能力进行了可行性和可用性测试,同时采用单机Graphchi对电信社交关系网络的数据进行了图挖掘研究和应用.     

基于视频多目标跟踪的高度测量算法

本文提出了一种基于视频多目标跟踪的高度测量算法.首先,采用码本模型检测前景,利用图割理论实现对多目标的跟踪.然后,提取每一帧中目标的头部特征点和脚部特征点,根据投影几何的约束关系计算每个目标的高度.最后,融合多帧的测量结果进行数据优化.本文提出的算法不需要对相机进行完全标定,只需计算摄像机的灭点和地平面的灭线,降低了计算的复杂度.实验结果表明,本文提出的算法具有较高的测量精度,对遮挡和运动状态变化具有较强的鲁棒性,同时,能够满足实时性要求.     

三甘醇脱水填料塔计算方法适用性分析

塔径计算是进行三甘醇填料脱水塔设计的首要工作,为了选用准确适用的塔径计算方法,详细介绍了多种塔径计算方法。以两个实际项目的数据为计算案例,分别采用贝恩-霍根(Bain-Haugen)关联式、通用压降关联图法(GPDC)、塔负荷系数法、Aspen HYSYS软件等不同方法计算三甘醇填料脱水塔的塔径,并进行了计算结果偏差分析和计算方法适用性分析。结果分析表明,塔负荷系数法、通用压降关联图法(GPDC)、Aspen HYSYS软件计算结果相近,经圆整后的塔径一致。贝恩-霍根(Bain-Haugen)关联式算出的结果偏差较大,过于保守,分别为11.11%和8.73%。由于通用压降关联图法(GPDC)的计算结果受GPDC关联图内数据点影响准确度不易保证,建议选用塔负荷系数法和Aspen HYSYS软件进行三甘醇脱水填料塔塔径的计算。      

A novel proximity graph: Circular neighborhood cell graph for histopathological tissue image analyzing

The cell is the smallest unit of living beings, which has structural and functional properties. Almost all cell behaviors are regulated by various intracellular reactions initiated by the signaling. The signaling and the distance between cells influence each other. Thus, cell-location-based modeling and analyzing of histopathological tissues provide important information to the expert. In literature, methods such as distance-based threshold, K-Nearest Neighbor, Voronoi graphs, Delaunay triangulation, and colored graph have been used. However, circular neighborhood relationships of cells have not been considered by any CAD system so far despite of its crucial impact. Thus, we developed the circular neighborhood cell-graph. Histopathological images of liver were classified by using features extracted from T-Distance, K-Nearest Neighbor, Voronoi, Delaunay, and the proposed cell-graph. Then, the classification performances of the methods were compared. Experimental results show that liver tissue images can be classified with accuracy of 95.7% by using the features provided by the proposed cell-graph model.     

基于图论的瓦斯抽采管网优化技术

为解决煤矿井下瓦斯抽采管网因系统变化导致的抽采效率降低的问题,根据抽采系统各项特性建立了有向图论模型,将瓦斯抽采浓度与混合流量赋值于模型点权参数,将瓦斯管路长度、管径赋值于图论模型边权参数,以O-D对流量概念和管路阻力计算为基础,得到了管网中各管段阻力损失,并确定了优化管段位置及优化方案和参数。对芦岭煤矿8210抽采区域进行优化后,优化管段阻力损失降低了8倍,优化区域抽采纯量提高了1倍以上。     

基于Citespace的我国稀土出口研究进展与热点分析

随着战略性新兴产业的兴起发展，稀土作为战略资源的重要地位不断凸显，作为公共产品供给，稀土出口问题备受国内外关注。文章运用CiteSpace软件并基于文献计量与知识图谱分析方法，以CNKI文献资料为数据源，对1993~2019年稀土出口研究相关文献从发文量、作者群体、发文机构、关键词、突现词及时间线方面进行分析，以探讨国内稀土出口领域研究的演进趋势与发展热点。结果表明：近年来稀土出口领域文献整体呈增长趋势，但是文献发表具有明显的波动性和政策关联性。作者群体和发文机构主要集中在具有科研优势或资源优势地区的高校，研究团队之间合作程度较低。稀土产业、出口管制、出口配额、出口定价、出口政策等成为文献关键词和高频词。未来的稀土出口领域的研究方向主要集中在出口定价、可持续发展、本土稀土产业链发展和稀土产业资本出口四个方面。     

用语图分析揭示语言系统中的隐性规律 ——赢家通吃和赢多输少算法

该文用“图”这一数学工具,通过定量分析来揭示语言系统中的隐性规律,设计了“赢家通吃”和“赢多输少”两种生成算法,将理想算法“步步竞争、择优而行”的博弈论思路贯彻到非理想状态。两种新算法都较前人有更好的概括能力。赢多输少算法更兼顾了充分概括和适度概括均衡。生成语图后,该设计着重准确率的最小简图和着重覆盖率的最大简图归纳算法,挖掘控制的主流规则、分析语言系统的语言学规律。在最小简图基础上提出控制度公式以评价语言系统。